Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
نویسندگان
چکیده
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-trees and box-trees.
منابع مشابه
Detecting Collisions in Graph-Driven Motion Synthesis
In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. We consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In cr...
متن کاملCAB: Fast Update of aBB Trees for Coil ision Detection Between Articulated Bodies
We present a new, fast approach for updating oriented bounding box hierarchies for articulated humanoid models, using a bottom up approach. The algorithm approximates existing techniques by assuming a major body axis. Existence of a major axis allows merging of bounding boxes in a hierarchy approximately but with sufficient accuracy. For scenarios with close proximity a speedup by a factor 2 on...
متن کاملEfficient Collision Detection of Complex Deformable Models using AABB Trees
We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme relies on a hierarchical model representation using axis-aligned bounding boxes (AABBs). In recent work, AABB trees have been shown to be slower than oriented bounding box (OBB) trees. In this paper, we describe a way to speed up overlap tests between AABBs, such that for...
متن کاملEfficient Collision Detection Using a Dual Bounding Volume Hierarchy
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some sepa...
متن کاملBounding Volumes for Proteins: A Comparative Study
A chain tree is a data structure for representing changing protein conformations. It enables very fast detection of clashes and free potential energy calculations. The efficiency of chain trees is closely related to the bounding volumes associated with chain tree nodes. A protein subchain associated with a node of a chain tree will clash with another subchain only if their bounding volumes inte...
متن کامل